A Fuzzy Algorithm for Scheduling Periodic Tasks on Multiprocessor Soft Real-Time Systems
نویسندگان
چکیده
In this paper we consider the use of fuzzy logic in the scheduling of periodic tasks in soft real-time multiprocessor systems. Most researches concerning real-time system scheduling assumes scheduling constraint to be precise. However, in many circumstances the values of these parameters are vague. The vagueness of parameters suggests that we make use of fuzzy logic to decide in what order the requests should be executed to better utilize the system and as a result reduce the chance of a request being missed. Our main contribution is proposing a fuzzy approach to multiprocessor real-time scheduling in which the scheduling parameters are treated as fuzzy variables. A simulation is also performed and the results are judged against each other. It is concluded that the proposed fuzzy approach is very promising and it has the potential to be considered for future research.
منابع مشابه
Soft Real-Time Fuzzy Task Scheduling for Multiprocessor Systems
All practical real-time scheduling algorithms in multiprocessor systems present a trade-off between their computational complexity and performance. In real-time systems, tasks have to be performed correctly and timely. Finding minimal schedule in multiprocessor systems with real-time constraints is shown to be NP-hard. Although some optimal algorithms have been employed in uni-processor systems...
متن کاملA Fuzzy Algorithm For Scheduling Real Time Jobs in Multiprocessor Systems
In this paper we consider the use of fuzzy logic in the scheduling of periodic tasks in soft real-time multiprocessor systems. In real-time systems, tasks have to be performed correctly and timely. Finding minimal schedule in multiprocessor systems with real time constraints is shown to be NP hard. Most researches concerning real-time system scheduling assume scheduling constraint to be precise...
متن کاملExtended Global Dual Priority Algorithm for Multiprocessor Scheduling in Hard Real-Time Systems
In this paper we present a global scheduling method for shared memory multiprocessor systems that provides a fixed-priority preemptive scheduling of periodic tasks, hard aperiodic tasks and soft aperiodic tasks on a set of identical processors. The method is based on the functioning of the Dual Priority Scheduling Algorithm extended to work in a multiprocessor environment. This algorithm guaran...
متن کاملSoft Aperiodic Task Scheduling on Hard Real-Time Multiprocessor Systems
The problem of jointly scheduling both hard deadline periodic tasks and soft aperiodic tasks has been the subject of considerable research in real-time systems. The main goal of such a system is to minimize the response time of soft aperiodic tasks, without jeopardizing the hard deadlines of periodic tasks. Although, several approaches have been developed to schedule critical workloads on multi...
متن کاملOnline Semi-Partitioned Multiprocessor Scheduling of Soft Real-Time Periodic Tasks for QoS Optimization
In this paper, we propose a novel semipartitioning approach with an online choice of two approximation algorithms, Greedy and Load-Balancing, to schedule periodic soft real-time tasks in homogeneous multiprocessor systems. Our objective is to enhance the QoS by minimizing the deadline misses and maximizing the total reward or benefit obtained by completed tasks in minimum response time. Many re...
متن کامل